Tighter Bounding Volumes for Better Occlusion Culling Performance
نویسندگان
چکیده
Bounding volumes are used in computer graphics to approximate the actual geometric shape of an object in a scene. The main intention is to reduce the costs associated with visibility or interference tests. The bounding volumes most commonly used have been axis-aligned bounding boxes and bounding spheres. In this paper, we propose the use of discrete orientation polytopes (k-dops) as bounding volumes for the specific use of visibility culling. Occlusion tests are computed more accurately using k-dops, but most importantly, they are also computed more efficiently. We illustrate this point through a series of experiments using a wide range of data models under varying viewing conditions. Although no bounding volume works the best in every situation, k-dops are often the best, and also work very well in those cases where they are not the best, therefore they provide good results without having to analyze applications and different bounding volumes.
منابع مشابه
CHC++: Coherent Hierarchical Culling Revisited
We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of temporal and spatial coherence of visibility. This is achieved by using adaptive visibility prediction and query batching. As a result of the new optimizations the number of issued occlusion queries and the number of ren...
متن کاملVisibility Driven Rasterization
We present a new visibility driven rasterization scheme that significantly increases the rendering performance of modern graphic subsystems. Instead of rasterizing, texturing, lighting, and depth-testing each individual pixel, we introduce a two-level visibility mask within the rasterization stage which facilitates the removal of groups of pixels and triangles from rasterization and subsequent ...
متن کاملEfficient bounding of displaced Bézier patches
In this paper, we present a new approach to conservative bounding of displaced Bézier patches. These surfaces are expected to be a common use case for tessellation in interactive and real-time rendering. Our algorithm combines efficient normal bounding techniques, min-max mipmap hierarchies and oriented bounding boxes. This results in substantially faster convergence for the bounding volumes of...
متن کاملEnhancing Bounding Volumes using Support Plane Mappings for Collision Detection
In this paper we present a new method for improving the performance of the widely used Bounding Volume Hierarchies for collision detection. The major contribution of our work is a culling algorithm that serves as a generalization of the Separating Axis Theorem for non parallel axes, based on the well-known concept of support planes. We also provide a rigorous definition of support plane mapping...
متن کاملHierarchical back-face culling for collision detection
A few years ago, Vanecek[16] suggested to apply a variant of back-face culling to speed-up collision detection between polyhedral objects. However, Vanecek’s method is linear in the number of faces in the object, which is unpractical for large models. This paper suggests to add some geometrical information to hierarchies of bounding volumes, typically used in collision detection, and perform co...
متن کامل